Subgraphs of pair vertices Lorentz Jäntschi
نویسنده
چکیده
Subgraphs obtained by applying several fragmentation criteria are investigated. Two well known criteria (Szeged and Cluj), and two new others are defined and characterized. An example is given for the discussed procedures. The matrix and polynomial representations of vertices composing each type of subgraphs were also given. Analytical formulas for the polynomials of several classes of graphs are derived. The newly introduced subgraphs/fragments, called MaxF and CMaxF, appear to have interesting properties, which are demonstrated.
منابع مشابه
Entropy Due to Fragmentation of Dendrimers
Subgraphs can results through application of criteria based on matrix whichcharacterize the entire graph. The most important categories of criteria are the ones able to produceconnected subgraphs (fragments). Based on theoretical frame on graph theory, the fragmentationalgorithm on pair of vertices containing the largest fragments (called MaxF) are exemplified. Thecounting polyn...
متن کاملCentrality of Some Cubic Graphs on 16 Vertices
There exist graphs of which all detours are Hamiltonian paths. Such graphs are called by Diudea (J. Chem. Inf. Comput. Sci. 1997, 37, 1101-1108) full Hamiltonian detour FHΔ graphs. These graphs show the maximal value of the Detour index while the minimal value of the Cluj-Detour index. A selected set of cubic graphs on 16 vertices is tested for the distribution of the relative centrality RC val...
متن کاملA simulation study for the distribution law of relative moments of evolution
LORENTZ JÄNTSCHI, SORANA D. BOLBOACĂ, AND RADU E. SESTRAS 1 Department of Genetics and Plant Breeding, University of Agricultural Science and Veterinary Medicine Cluj-Napoca, Cluj-Napoca 400372, Romania; Department of Physics and Chemistry, Technical University of Cluj-Napoca, Cluj-Napoca 400641, Romania; and Department of Medical Informatics and Biostatistics, ‘‘Iuliu Hatieganu’’ University of...
متن کاملTOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملخواص متریک و ترکیبیاتی مکعبهای فیبوناتچی و لوکاس
An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs ...
متن کامل